Characterisation of Approximation and (Head) Normalisation for $\lambda\mu$ using Strict Intersection Types
نویسنده
چکیده
We study the strict type assignment for λμ that is presented in [7]. We define a notion of approximants of λμ-terms, show that it generates a semantics, and that for each typeable term there is an approximant that has the same type. We show that this leads to a characterisation via assignable types for all terms that have a head normal form, and to one for all terms that have a normal form, as well as to one for all terms that are strongly normalisable.
منابع مشابه
Characterisation of Approximation and (Head) Normalisation for λμ using Strict Intersection Types
We study the strict type assignment for λμ that is presented in [7]. We define a notion of approximants of λμ-terms, show that it generates a semantics, and that for each typeable term there is an approximant that has the same type. We show that this leads to a characterisation via assignable types for all terms that have a head normal form, and to one for all terms that have a normal form, as ...
متن کاملCut-elimination in the Strict Intersection Type Assignment System Is Strongly Normalising
This paper defines reduction on derivations in the strict intersection type assignment system of [1], by generalising cut-elimination, and shows a strong normalisation result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterisation of normalisability using intersection types.
متن کاملThe heart of intersection type assignment: Normalisation proofs revisited
This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types for a system with ω and a ≤-relation that is contravariant over arrow types. The technique applied is to define reduction on derivations and to show a strong normalisation result for this reduction. From this result, the characterisation of strong normalisation and the...
متن کاملStrongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterisation of normalisability using intersection types.
متن کاملCut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing
“ This paper defines reduction on derivations (cut-elimination) in the Strict Intersection Type Assignment System of [1] and shows a strong normalisation result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterisation of normalisability of terms, using intersection types. ”
متن کامل